Regular relations for temporal propositions
نویسندگان
چکیده
منابع مشابه
Temporal Propositions as Vague Predicates
The idea that temporal propositions are vague predicates is examined with attention to the nature of the objects over which the predicates range. These objects should not, it is argued, be identified once and for all with points or intervals in the real line (or any fixed linear order). Context has an important role to play not only in sidestepping the Sorites paradox (Gaifman 2002) but also in...
متن کاملTemporal Assertions with Parametrised Propositions
Aspects have been successfully promoted as a means to improve the modularization of software in the presence of crosscutting concerns. The so-called aspect interference problem is considered to be one of the remaining challenges of aspect-oriented software development: aspects may interfere with the behavior of the base code or other aspects. Especially interference between aspects is difficult...
متن کاملAn Extended Theory of Temporal Propositions
This paper presents an extended theory of temporal propositions based on a general time axiomatisation. The time axiomatisation characterises both intervals and points as primitive time elements on an equal footing. It is shown that this extended theory may subsume some existing theories, such as Allen’s interval-based theory of action and time, the correspondingly revised theory proposed by Ga...
متن کاملGood strongly regular relations on weak $Gamma$-(semi)hypergroups
In this paper first we introduce the notion of weak $Gamma$-(semi)hypergroups, next some classes of equivalence relations which are called good regular and strongly good regular relations are defined. Then we investigate some properties of this kind of relations on weak $Gamma$-(semi)hypergroups.
متن کاملA Regular Query for Context-Sensitive Relations
One of the fundamental problems when defining a query language for databases consists in finding a balance between the desiderata of a sufficiently large expressive power on the one hand and an adequate computability of queries on the other. This problem occurs of course also with linguistic treebanks, the prototype of non-relational semistructured databases. There are many linguistic phenomena...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Language Engineering
سال: 2011
ISSN: 1351-3249,1469-8110
DOI: 10.1017/s135132491100009x